Lindig's Algorithm for Concept Lattices over Graded Attributes
نویسندگان
چکیده
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), where table entries are grades representing degrees to which objects have attributes. The main output of FCA is a hierarchical structure (so-called concept lattice) of conceptual clusters (so-called formal concepts) present in the data. This paper focuses on algorithmic aspects of FCA of data with graded attributes. Namely, we focus on the problem of generating efficiently all clusters present in the data together with their subconcept-superconcept hierarchy. We present theoretical foundations, the algorithm, analysis of its efficiency, and comparison with other algorithms.
منابع مشابه
Estimations of Similarity in Formal Concept Analysis of Data with Graded Attributes
We study similarity in formal concept analysis of data tables with graded attributes. We focus on similarity related to formal concepts and concept lattices, i.e. the outputs of formal concept analysis. We present several formulas for estimation of similarity of outputs in terms of similarity of inputs. The results answer some problems which arose in previous investigation as well as some natur...
متن کاملTriadic concept lattices of data with graded attributes
We present foundations for triadic concept analysis of data with graded attributes. Triadic concept analysis departs from the dyadic case by taking into account modi, such as time instances or conditions, under which objects have attributes. That is, instead of a two-dimensional table filled with 0s and 1s (equivalently, binary relation or two-dimensional binary matrix), the input data in triad...
متن کاملComputing sets of graded attribute implications with witnessed non-redundancy
In this paper we extend our previous results on sets of graded attribute implications with witnessed non-redundancy. We assume finite residuated lattices as structures of truth degrees and use arbitrary idempotent truth-stressing linguistic hedges as parameters which influence the semantics of graded attribute implications. In this setting, we introduce algorithm which transforms any set of gra...
متن کاملRelational Data, Formal Concept Analysis, and Graded Attributes
Formal concept analysis is a particular method of analysis of relational data. In addition to tools for data analysis, formal concept analysis provides elaborated mathematical foundations for relational data. In the course of the last decade, several attempts appeared to extend formal concept analysis to data with graded (fuzzy) attributes. Among these attempts, an approach based on residuated ...
متن کاملOrdinally equivalent data: A measurement-theoretic look at formal concept analysis of fuzzy attributes
We show that if two fuzzy relations, representing data tables with graded attributes, are ordinally equivalent then their concept lattices with respect to the Gödel operations on chains are (almost) isomorphic and that the assumption of Gödel operations is essential. We argue that measurement-theoretic results like this one are important for pragmatic reasons in relational data modeling and out...
متن کامل